Counting Phylogenetic Networks
نویسندگان
چکیده
We give approximate counting formulae for the numbers of labelled general, tree-child, and normal (binary) phylogenetic networks on n vertices. These formulae are of the form 2 , where the constant γ is 32 for general networks, and 5 4 for tree-child and normal networks. We also show that the number of leaf-labelled tree-child and normal networks with ` leaves are both 2 log . Further we determine the typical numbers of leaves, tree vertices, and reticulation vertices for each of these classes of networks.
منابع مشابه
Counting Trees in a Phylogenetic Network Is \#P-Complete
Answering a problem posed by Nakhleh, we prove that counting the number of phylogenetic trees inferred by a (binary) phylogenetic network is #P-complete. An immediate consequence of this result is that counting the number of phylogenetic trees commonly inferred by two (binary) phylogenetic networks is also #P-complete.
متن کاملCounting Faces in Split Networks
SplitsTree is a popular program for inferring and visualizing various phylogenetic networks including split networks. Split networks are useful for realizing metrics that are linear combinations of split metrics. We show that the realization is not unique in some cases and design an algorithm for computing split networks with minimum number of faces. We also prove that the minimum number of fac...
متن کاملCounting consistent phylogenetic trees is #P-complete
Reconstructing phylogenetic trees is a fundamental task in evolutionary biology. Various algorithms exist for this purpose, many of which come under the heading of ‘supertree methods.’ These methods amalgamate a collection P of phylogenetic trees into a single parent tree. In this paper, we show that, in both the rooted and unrooted settings, counting the number of parent trees that preserve al...
متن کاملApproximately Counting Locally-Optimal Structures
In general, constructing a locally-optimal structure is a little harder than constructing an arbitrary structure, but significantly easier than constructing a globally-optimal structure. A similar situation arises in listing. In counting, most problems are #P-complete, but in approximate counting we observe an interesting reversal of the pattern. Assuming that #BIS is not equivalent to #SAT und...
متن کاملA Survey on Counting Networks
In the counting problem, asynchronous concurrent processes repeatedly assign themselves successive values, such as integers or locations in memory. Counting networks are a class of concurrent data structures that support highly concurrent counting in a way that minimizes serialization and memory contention. In the past six years, counting networks have been the focus of a growing body of resear...
متن کامل